On Annihilatingly Uniqueness of Directed Windmills
نویسنده
چکیده
Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomial f(x) of degree at most n is called an annihilating polynomial of G if f(A(G)) = 0. G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. In this paper, the directed windmill M3(r) is defined and we study the annihilating uniqueness of M3(r).
منابع مشابه
Existence and uniqueness of the solution for a general system of operator equations in $b-$metric spaces endowed with a graph
The purpose of this paper is to present some coupled fixed point results on a metric space endowed with two $b$-metrics. We shall apply a fixed point theorem for an appropriate operator on the Cartesian product of the given spaces endowed with directed graphs. Data dependence, well-posedness and Ulam-Hyers stability are also studied. The results obtained here will be applied to prove the existe...
متن کاملThe complete product of annihilatingly unique digraphs
Let G be a digraph with n vertices and let A(G) be its adjacency matrix. A monic polynomial f (x) of degree at most n is called an annihilating polynomial of G if f (A(G)) = 0. G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. Difans and diwheels are two classes of annihilatingly unique digraphs. In this paper, it is shown that the complete product of difan...
متن کاملOn Digraphs with Non-derogatory Adjacency Matrix
Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomial f(x) of degree at most n is called an annihilating polynomial of G if . 0 )) ( ( = G A f G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. We prove that two families of digraphs, i.e., the ladder digraphs and the difans, are annihilatingly unique by studying the similari...
متن کاملNonderogatory directed windmills Molinos de viento dirigidos no derogatorios
Abstract. A directed graph G is nonderogatory if its adjacency matrix A is nonderogatory, i.e., the characteristic polynomial of A is equal to the minimal polynomial of A. Given integers r ≥ 2 and h ≥ 3, a directed windmill Mh (r) is a directed graph obtained by coalescing r dicycles of length h in one vertex. In this article we solve a conjecture proposed by Gan and Koo ([3]): Mh (r) is nonder...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کامل